Performance Evaluation of Deadline Monotonic Policy over 802.11 protocol

نویسندگان

  • Ines El Korbi
  • Leila Azouz Saidane
چکیده

Real time applications are characterized by their delay bounds. To satisfy the Quality of Service (QoS) requirements of such flows over wireless communications, we enhance the 802.11 protocol to support the Deadline Monotonic (DM) scheduling policy. Then, we propose to evaluate the performance of DM in terms of throughput, average medium access delay and medium access delay distrbution. To evaluate the performance of the DM policy, we develop a Markov chain based analytical model and derive expressions of the throughput, average MAC layer service time and service time distribution. Therefore, we validate the mathematical model and extend analytial results to a multi-hop network by simulation using the ns-2 network simulator.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deadline Monotonic Policy over 802.11 Throughput and Average Service Time

In this paper, we propose a real time scheduling policy over 802.11 DCF protocol called Deadline Monotonic (DM). We evaluate the performance of this policy for a simple scenario where two stations with different deadlines contend for the channel. For this scenario a Markov chain based analytical mode is proposed. From the mathematical model, we derive expressions of the saturation throughout an...

متن کامل

MAC Layer Service Time Distribution of a Fixed Priority Real Time Scheduler over 802.11

In this paper, we propose to support a fixed priority real time scheduler over 802.11 protocol called Deadline Monotonic (DM). We evaluate the performances of this policy for a simple scenario where two stations with different delay constraints contend for the channel. For this scenario a Markov chain based analytical model is proposed. From the mathematical model, we derive the probability dis...

متن کامل

A Fixed-Priority-Driven Open Environment for Real-Time Applications

This paper extends the useful concept of open systems proposed by Liu, et al. [2, 3] in scheduling realtime applications and non-real-time applications, where the schedulability of each real-time application can be validated independently of other applications in the system. We replace the underlying earliest-deadlinerst OS scheduler of the open system architecture in [2, 3] with a rate-monoton...

متن کامل

A Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy

This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...

متن کامل

A Hidden Node Aware Network Allocation Vector Management System for Multi-hop Wireless Ad hoc Networks

Many performance evaluations for IEEE 802.11distributed coordination function (DCF) have been previouslyreported in the literature. Some of them have clearly indicatedthat 802.11 MAC protocol has poor performance in multi-hopwireless ad hoc networks due to exposed and hidden nodeproblems. Although RTS/CTS transmission scheme mitigatesthese phenomena, it has not been successful in thoroughlyomit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007